Harmonious logic: Craig's interpolation theorem and its descendants

نویسنده

  • Solomon Feferman
چکیده

model theory S. Feferman and J. Barwise (eds.) (1985), ModelTheoretic Logics. Abstract model theory deals with properties of model-theoretic logics L, specified by an abstract syntaxi.e. a set of “sentences” satisfying suitable closure conditionsand “satisfaction” relation M |= φ for φ a sentence of L. With each such L is associated its collection of Elementary Classes, ECL, and from that its collection of Projective Classes, PCL. L ⊆ L* if ECL ⊆ ECL*.model theory deals with properties of model-theoretic logics L, specified by an abstract syntaxi.e. a set of “sentences” satisfying suitable closure conditionsand “satisfaction” relation M |= φ for φ a sentence of L. With each such L is associated its collection of Elementary Classes, ECL, and from that its collection of Projective Classes, PCL. L ⊆ L* if ECL ⊆ ECL*.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Harmonious Logic Harmonious Logic : Craig ’ s Interpolation Theorem and its Descendants

Though deceptively simple and plausible on the face of it, Craig’s interpolation theorem (published 50 years ago) has proved to be a central logical property that has been used to reveal a deep harmony between the syntax and semantics of first order logic. Craig’s theorem was generalized soon after by Lyndon, with application to the characterization of first order properties preserved under hom...

متن کامل

Duality between Logics and Equivalence Relations

Assuming w is the only measurable cardinal, we prove: (i) Let ~ be an equivalence relation such that ~ = =z. for some logic L < L* satisfying Robinson's consistency theorem (with L* arbitrary); then there exists a strongest logic L+ « L* such that ~ = =/.+ ; in addition, L+ is countably compact if ~^= . (ii) Let ~ be an equivalence relation such that ~ = =/." for some logic L° satisfying Robins...

متن کامل

Mechanising a Proof of Craig's Interpolation Theorem for Intuitionistic Logic in Nominal Isabelle

Craig’s Interpolation Theorem is an important meta-theoretical result for several logics. Here we describe a formalisation of the result for first-order intuitionistic logic without function symbols or equality, with the intention of giving insight into how other such results in proof theory might be mechanically verified, notable cut-admissibility. We use the package Nominal Isabelle, which ea...

متن کامل

Constructing Craig Interpolation Formulas

1 Background and Introduction Let 27 and H be two inconsistent first order theories. Then by Craig's Interpolation Theorem, there is a sentence 8, called a Craig interpolant, such that 8 is t rue in 27 and false in H and every nonlogical symbol occurring in 8 occurs in bo th 27 and H. Craig interpolants can be used to solve the problem of learning a first order concept by letting 27 and H be th...

متن کامل

Craig's Interpolation Theorem formalised and mechanised in Isabelle/HOL

We formalise and mechanise a construtive, proof theoretic proof of Craig’s Interpolation Theorem in Isabelle/HOL. We give all the definitions and lemma statements both formally and informally. We also transcribe informally the formal proofs. We detail the main features of our mechanisation, such as the formalisation of binding for first order formulae. We also give some applications of Craig’s ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Synthese

دوره 164  شماره 

صفحات  -

تاریخ انتشار 2008